on improving apit algorithm for better localization in wsn

in wireless sensor networks (wsns), localization algorithms could be range-based or range-free. the approximate point in triangle (apit) is a range-free approach. we propose modification of the apit algorithm and refer as modified-apit. we select suitable triangles with appropriate distance between anchors to reduce pit test errors (edge effect and non-uniform placement of neighbours) in apit algorithm. to reduce the computational load and avoid useless anchors selection, we propose to segment the application area to four non-overlapping and four overlapping sub-regions. our results show that the modified-apit algorithm has better performance in terms of average error and time requirement for all sizes of network with random and grid deployments. for increasing the accuracy of localization and reduction of computation time, every sub-region should contain minimum 5 anchors. the modified-apit has better performance for different sizes of network for both grid and random deployments in terms of average error and time requirement. variations of the size of a network and radio communication radius of anchors affect the value of average error and time requirement. to have more accurate location estimation, 5 to 10 anchors per sub-region are effective in modified-apit.